منابع مشابه
BEST APPROXIMATION SETS IN -n-NORMED SPACE CORRESPONDING TO INTUITIONISTIC FUZZY n-NORMED LINEAR SPACE
The aim of this paper is to present the new and interesting notionof ascending family of $alpha $−n-norms corresponding to an intuitionistic fuzzy nnormedlinear space. The notion of best aproximation sets in an $alpha $−n-normedspace corresponding to an intuitionistic fuzzy n-normed linear space is alsodefined and several related results are obtained.
متن کاملAutomotive Control Revisited: Linear Inequalities as Approximation of Reachable Sets
Reachability analysis of hybrid system imposes restrictions on the continuous and discrete behavior. In this paper a method is proposed to approximate the reachable set of linear systems by linear inequalities. It allows to use the full continuous dynamics of hybrid systems for reachability analysis. This method is applied to an automotive control problem, which was presented by Stauner et al. ...
متن کاملLinear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc networks. Since the minimum dominating set problem for unit disk graphs is NP-hard, several approximation algorithms with different merits have been proposed in the literature. On one extreme, there is a linear time 5-a...
متن کاملbiaccessibility in quadratic julia sets
در این رساله برای چندجمله ای های درجه ی دوم با مجموعه ی ژولیای همبند موضعی; ثابت خواهیم کرد: اندازه برولین مجموعه نقاط از دو سو دست یافتنی در چندجمله ای های درجه دو برابر با صفر است مگر چندجمله ای چبی شف که برابر با یک است. و برای چندجمله ای های درجه دوم با نقاط ثابت خنثی غیر گویا ثابت خواهیم کرد: 1)هر نقطه ی از دو سو دست یافتنی در حالت زیگل نهایتا به نقطه ی بحرانی و در حالت کرمر به نقطه ث...
H-forming sets in graphs
For graphs G and H , a set S ⊆ V (G) is an H -forming set of G if for every v∈V (G) − S, there exists a subset R ⊆ S, where |R|= |V (H)| − 1, such that the subgraph induced by R∪{v} contains H as a subgraph (not necessarily induced). The minimum cardinality of an H -forming set of G is the H -forming number {H}(G). The H -forming number of G is a generalization of the domination number (G) beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1977
ISSN: 0021-9045
DOI: 10.1016/0021-9045(77)90068-5